منابع مشابه
On recognition of threshold tolerance graphs and their complements
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tol...
متن کاملProper and Unit Tolerance Graphs
We answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs that are not unit tolerance graphs. An infinite family of graphs that are minimal in this respect is specified.
متن کاملFriedmann-robertson-walker Cosmologies
Abstract. Electrodynamics for self-interacting scalar fields in spatially flat FriedmannRobertson-Walker space-times is studied. The corresponding one-loop field equation for the expectation value of the complex scalar field in the conformal vacuum is derived. For exponentially expanding universes, the equations for the Bogoliubov coefficients describing the coupling of the scalar field to grav...
متن کاملRobertson Intelligent States
Diagonalization of uncertainty matrix and minimization of Robertson inequality for n observables are considered. It is proved that for even n this relation is minimized in states which are eigenstates of n/2 independent complex linear combinations of the observables. In case of canonical observables this eigenvalue condition is also necessary. Such minimizing states are called Robertson intelli...
متن کاملAlexander Robertson 1896-1970.
here corner of the article or click article-sign up in the box at the top right-hand Receive free email alerts when new articles cite this
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Archaeology
سال: 2005
ISSN: 0002-9114
DOI: 10.3764/aja.109.3.557